Efficient methods for selfish network design

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Methods for Selfish Network Design

Intuitively, Braess’s paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phenomenon in real-world networks. Any administrator that wants to improve equilibrium delays in selfish networks, is facing some basic questions: – Is the network paradox-ridden? – How can we delete some edges to optimize eq...

متن کامل

Sharing Costs for Better Selfish Network Design

We consider how to design network cost-sharing protocols to induce benign selfish behavior in large networks. We study this issue in network cost-sharing games, where the set of Nash equilibria depends fundamentally on the choice of the underlying edge cost-sharing protocols. We seek cost-sharing protocols that minimize the inefficiency of equilibria in the resulting network design game, as mea...

متن کامل

Network Design with Selfish Agents

Think of sea transport companies or broadband internet providers each company needs to connect a few ports or users every connection has a constant cost connection is bought if all together pay for it no additional utility Network Design with Selfish Agents – p.3

متن کامل

Geometric Network Design with Selfish Agents

We study a geometric version of a simple non-cooperative network creation game introduced in [2], assuming Euclidean edge costs on the plane. The price of anarchy in such geometric games with k players is Θ(k). Hence, we consider the task of minimizing players incentives to deviate from a payment scheme, purchasing the minimum cost network. In contrast to general games, in small geometric games...

متن کامل

Methods for Efficient Network Coding

I. INTRODUCTION Random linear network coding is a multicast communication scheme in which all participating nodes send out coded packets formed from random linear combinations of packets received so far. This scheme is capacity-achieving for single sessions over lossy wireline or wireless packet networks [1], [2], [3], [4]. Thus, from the point of view of efficiently utilizing transmissions, ra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2012

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2012.04.033